POPULAR MATCHINGSABRAHAM, David J; IRVING, Robert W; KAVITHA, Telikepalli et al.SIAM journal on computing (Print). 2008, Vol 37, Num 4, pp 1030-1045, issn 0097-5397, 16 p.Article

A better list heuristic for vertex coverDELBOT, Francois; LAFOREST, Christian.Information processing letters. 2008, Vol 107, Num 3-4, pp 125-127, issn 0020-0190, 3 p.Article

On the stack-size of general triesBOURDON, Jérémie; NEBEL, Markus; VALLEE, Brigitte et al.Theoretical informatics and applications. 2001, Vol 35, Num 2, pp 163-185Article

The longest almost-increasing subsequenceELMASRY, Amr.Information processing letters. 2010, Vol 110, Num 16, pp 655-658, issn 0020-0190, 4 p.Article

Algorithm to compute the maximal abelian dimension of Lie algebrasCEBALLOS, M; NUNEZ, J; TENORIO, A. F et al.Computing (Wien. Print). 2009, Vol 84, Num 3-4, pp 231-239, issn 0010-485X, 9 p.Article

An algorithm for partitioning trees augmented with sibling edgesBORDAWEKAR, Rajesh; SHMUELI, Oded.Information processing letters. 2008, Vol 108, Num 3, pp 136-142, issn 0020-0190, 7 p.Article

A CONSTANT-FACTOR APPROXIMATION ALGORITHM FOR OPTIMAL 1.5D TERRAIN GUARDINGBEN-MOSHE, Boaz; KATZ, Matthew J; MITCHELL, Joseph S. B et al.SIAM journal on computing (Print). 2007, Vol 36, Num 6, pp 1631-1647, issn 0097-5397, 17 p.Article

RANDOMIZED DIVIDE-AND-CONQUER: IMPROVED PATH, MATCHING, AND PACKING ALGORITHMSCHEN, Jianer; KNEIS, Joachim; LU, Songjian et al.SIAM journal on computing (Print). 2009, Vol 38, Num 6, pp 2526-2547, issn 0097-5397, 22 p.Article

EQUITABLE COST ALLOCATIONS VIA PRIMAL-DUAL-TYPE ALGORITHMSJAIN, Kamal; VAZIRANI, Vijay V.SIAM journal on computing (Print). 2008, Vol 38, Num 1, pp 241-256, issn 0097-5397, 16 p.Article

Calculating lower bounds for caching problemsEPSTEIN, L; VAN STEE, R.Computing (Wien. Print). 2007, Vol 80, Num 3, pp 275-285, issn 0010-485X, 11 p.Article

Algorithms for RH mapping: New ideas and improved analysisIVANSSON, Lars; LAGERGREN, Jens.SIAM journal on computing (Print). 2005, Vol 34, Num 1, pp 89-108, issn 0097-5397, 20 p.Article

Compositional competitiveness for distributed algorithmsASPNES, James; WAARTS, Orli.Journal of algorithms (Print). 2005, Vol 54, Num 2, pp 127-151, issn 0196-6774, 25 p.Article

Proportion extend sortCHEN, Jing-Chao.SIAM journal on computing (Print). 2001, Vol 31, Num 1, pp 323-330, issn 0097-5397Article

A volume first maxima-finding algorithmXIANGQUAN QUI; XIAOHONG HAO; YUANPING ZHANG et al.Theoretical computer science. 2011, Vol 412, Num 45, pp 6316-6326, issn 0304-3975, 11 p.Article

Bounded parallel-batch scheduling on single and multi machines for deteriorating jobsCUIXIA MIAO; YUZHONG ZHANG; ZHIGANG CAO et al.Information processing letters. 2011, Vol 111, Num 16, pp 798-803, issn 0020-0190, 6 p.Article

Computing minimum diameter color-spanning sets is hardFLEISCHER, Rudolf; XIAOMING XU.Information processing letters. 2011, Vol 111, Num 21-22, pp 1054-1056, issn 0020-0190, 3 p.Article

Fast leader election in anonymous rings with bounded expected delayBAKHSHI, Rena; ENDRULLIS, Jörg; FOKKINK, Wan et al.Information processing letters. 2011, Vol 111, Num 17, pp 864-870, issn 0020-0190, 7 p.Article

PREEMPTIVE ONLINE SCHEDULING WITH REORDERINGDOSA, Gyorgy; EPSTEIN, Leah.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 21-49, issn 0895-4801, 29 p.Article

The distributed wireless gathering problemBONIFACI, Vincenzo; KORTEWEG, Peter; MARCHETTI-SPACCAMELA, Alberto et al.Theoretical computer science. 2011, Vol 412, Num 8-10, pp 633-641, issn 0304-3975, 9 p.Article

Two-dimensional homing sortWANG, Bo-Yi; LU, Hsueh-I.Information processing letters. 2011, Vol 111, Num 21-22, pp 1067-1071, issn 0020-0190, 5 p.Article

FITTING TREE METRICS: HIERARCHICAL CLUSTERING AND PHYLOGENYAILON, Nir; CHARIKAR, Moses.SIAM journal on computing (Print). 2011, Vol 40, Num 5, pp 1275-1291, issn 0097-5397, 17 p.Article

Distributional analysis of swaps in Quick SelectMAHMOUD, Hosam M.Theoretical computer science. 2010, Vol 411, Num 16-18, pp 1763-1769, issn 0304-3975, 7 p.Article

ONLINE CAPACITATED INTERVAL COLORINGEPSTEIN, Leah; ERLEBACH, Thomas; LEVIN, Asaf et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 822-841, issn 0895-4801, 20 p.Article

Playing the perfect Kriegspiel endgameCIANCARINI, Paolo; PIERO FAVINI, Gian.Theoretical computer science. 2010, Vol 411, Num 40-42, pp 3563-3577, issn 0304-3975, 15 p.Article

THE ONLINE SET COVER PROBLEMALON, Noga; AWERBUCH, Baruch; AZAR, Yossi et al.SIAM journal on computing (Print). 2010, Vol 39, Num 2, pp 361-370, issn 0097-5397, 10 p.Article